Queueing networks: rare events and fast simulations

نویسنده

  • Denis I. Miretskiy
چکیده

Acknowledgements From the very beginning I would like to thank my supervisor Werner Scheinhardt. I am deeply grateful for the time we spent in the discussions, for his faithful suggestions , his great patience and certainly for the great work atmosphere we had for the last four years. Above all I would like to thank Werner for his help outside the university. I am sure that this thesis could not have its current form without the help and supervision of my promoter Michel Mandjes. I would like to express my gratitude for his irreplaceable ideas, motivation and for steering me in the right direction. Finally, I would like to thank my other promoter and chair of the Stochastic Operations Research group Richard Boucherie for giving me the opportunity to complete my Ph.D. research in The Netherlands. I am also grateful to him for introducing new horizons of precision and accuracy to me. Ridder for their valuable inputs and efforts in reviewing this thesis. I would like to thank all of my SOR colleagues for a pleasant and efficient job climate. My special gratitude goes to my constant officemate Tom Coenen, who was not only an excellent companion, but one of my main guides into Dutch culture. I would like to acknowledge all members of the SOR group: Kamphuis-Kuijpers and Yana Volkovich. My distinct recognition goes to Yana, who was not only a co-worker but a friend, for all great times we had in the past years. I would like to express my gratitude to my former supervisors Victor Goryainov and Alexander Gnedin for arising and maintaining an interest for stochastics in me. and Sabrina for being such great guys. My special appreciation goes to Jon my roommate, friend and a great person to watch ice hockey with. Thanks to Domi for lots of 'Goulash' events, and to Paul for keeping me updated about important changes in Enschede's life. I would like to mention my friends in Russia, 5 6 Anya, Dima and Anton. And of course I am very thankful to my mom, dad and all my family for their support and belief! Last but not least I am infinitely thankful to my girlfriend Katya. It is difficult or even impossible to underestimate her input to my life and to this work in particular. Katya, thank you for your love, understanding, support and everything else you have been doing for …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dynamic Importance Sampling Methodology for the Efficient Estimation of Rare Event Probabilities in Regenerative Simulations of Queueing Systems

Importance sampling (IS) is recognized as a potentially powerful method for reducing simulation runtimes when estimating the probabilities of rare events in communication systems using Monte Carlo simulation. When simulating networks of queues, regenerative techniques must be used in order to make the application of IS feasible and efficient. The application of regenerative techniques is also c...

متن کامل

Analysis of rare events in queueing systems with model uncertainty

We describe a method to quantify robustness in the estimation of probabilities of rare events. Robustness to the underlying probabilistic model is expressed in terms of Rényi divergences. The main application area discussed is queueing networks.

متن کامل

Dynamic Importance Sampling for Queueing Networks

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even ...

متن کامل

Estimation of Rare Event Statistics in Data

The estimation of the statistics of rare events is inherently costly, simply because of their rarity. This paper describes some recently developed techniques for the efficient simulation of rare events in telecommunications networks. The work described is split into three broad themes: the optimal simulation of buffer overflows in queueing networks, reverse-time modeling of random processes and...

متن کامل

Computing Queue-Length Distributions for Power-Law Queues

The interest sparked by observations of long-range dependent traffic in real networks has lead to a revival of interest in non-standard queueing systems. One such queueing system is the M/G/l queue where the service-time distribution has infinite variance. The known results for such systems are asymptotic in nature, typically providing the asymptotic form for the tail of the workload distributi...

متن کامل

Efficient calculation of rare event probabilities in Markovian queueing networks

We address the computation of rare event probabilities in Markovian queueing networks with huge or possibly even infinite state spaces. For this purpose, we incorporate ideas from importance sampling simulations into a non-simulative numerical method that approximates transient probabilities based on a dynamical truncation of the state space. A change of measure technique is applied in order to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009